package algorithm.tree.bst;

public class TreeNode {

  public TreeNode left;

  public TreeNode right;

  public int val;

  public Entity value;

  int n; //以当前node为根节点，节点的总数

  public TreeNode(int val) {
    this.val = val;
  }


  public TreeNode(Entity t) {
    this.value = t;
  }

  public TreeNode(Entity t, int n) {
    this.value = t;
    this.n = n;


  }




}
